Bit-parallel approximate string matching algorithms with transposition
نویسندگان
چکیده
منابع مشابه
Bit-Parallel Approximate String Matching Algorithms with Transposition
Using bit-parallelism has resulted in fast and practical algorithms for approximate string matching under the Levenshtein edit distance, which permits a single edit operation to insert, delete or substitute a character. Depending on the parameters of the search, currently the fastest non-filtering algorithms in practice are the O(kn!m/w") algorithm of Wu & Manber, the O(!km/w"n) algorithm of Ba...
متن کاملEfficient bit-parallel multi-patterns approximate string matching algorithms
Multi-patterns approximate string matching (MASM) problem is to find all the occurrences of set of patterns P0, P1, P2...Pr-1, r≥1, in the given text T[0...n-1], allowing limited number of errors in the matches. This problem has many applications in computational biology viz. finding DNA subsequences after possible mutations, locating positions of a disease(s) in a genome etc. The MASM problem ...
متن کاملFaster Bit-Parallel Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The rst one Myers, J. of the ACM, 1999], searches for a pattern of length m in a text of length n permitting k diierences in O(mn=w) time, where w is the width of the computer word. The second one Navarro and Raanot, ACM JEA, 2000], extends a sublinear-time exact algorithm to approximat...
متن کاملAlternative Algorithms for Bit-Parallel String Matching
We consider bit-parallel algorithms of Boyer-Moore type for exact string matching. We introduce a two-way modification of the BNDM algorithm. If the text character aligned with the end of the pattern is a mismatch, we continue by examining text characters after the alignment. Besides this two-way variation, we present a simplified version of BNDM without prefix search and an algorithm scheme fo...
متن کاملApproximate String Matching with Address Bit Errors
Motivation In the " old " days: Pattern and text are given in correct sequential order. It is possible that the .content is erroneous New paradigm: Content is exact, but the order of .the pattern symbols may be scrambled Why? Transmitted asynchronously? ? The nature of the application Example:Swaps Tehse kni ds of typing mistakes are very common So when searching for patternThese we are seeking...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2005
ISSN: 1570-8667
DOI: 10.1016/j.jda.2004.08.006